Accelerating the Uzawa Algorithm
نویسندگان
چکیده
The Uzawa algorithm is an iterative method for the solution of saddle-point problems, which arise in many applications, including fluid dynamics. Viewing the Uzawa algorithm as a fixedpoint iteration, we explore the use of Anderson acceleration (also knownas Anderson mixing) to improve the convergence. We compare the performance of the preconditioned Uzawa algorithm with and without acceleration on several steady Stokes and Oseen problems for incompressible flows. For perspective, we include in our comparison several other iterative methods that have appeared in the literature. The results indicate that the accelerated preconditioned Uzawa algorithm converges significantly faster than the algorithm without acceleration and is competitive with the other methods considered.
منابع مشابه
Efficient Uzawa Algorithms for Two Phase Stefan Type Problems
In this paper we present and analyze Uzawa type algorithms for solving discretized variational inequalities arising from two phase Stefan type problems. For a Uzawa type algorithm and its improved version we show convergence and derive bounds on convergence rates. For the improved Uzawa algorithm, the convergence rate is shown to be uniformly bounded away from 1 if τh−2 is kept bounded, with τ ...
متن کاملA modified inexact Uzawa A lgorithm for generalized saddle point problems
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171]. Keywords—Saddle point problem; Inexact Uzawa algorithm; Convergence behavior.
متن کاملAn Inexact Uzawa-Type Iterative Method for Solving Saddle Point Problems
As an extension of the inexact Uzawa algorithm addressed in 1], we propose an improved inexact Uzawa-type iterative method for solving saddle point problems. The convergence rate is given in terms of the rates of the two basic iterations as deened in 1], and it is shown that the new algorithm always converges as long as the two basic iterations converge. A running title: Uzawa algorithm for sad...
متن کاملInexact Uzawa Algorithms for Variational Inequalities of the Second Kind
In this paper we discuss inexact Uzawa algorithms and inexact nonlinear Uzawa algorithms to solve discretized variational inequalities of the second kind. We prove convergence results for the algorithms. Numerical examples are included to show the effectiveness of the algorithms.
متن کاملComparative analysis of different variants of the Uzawa algorithm in problems of the theory of elasticity for incompressible materials
Different variants of the Uzawa algorithm are compared with one another. The comparison is performed for the case in which this algorithm is applied to large-scale systems of linear algebraic equations. These systems arise in the finite-element solution of the problems of elasticity theory for incompressible materials. A modification of the Uzawa algorithm is proposed. Computational experiments...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 39 شماره
صفحات -
تاریخ انتشار 2017